Convex analysis

Results: 1100



#Item
41Monotone crossing number of complete graphs Martin Balko, Radoslav Fulek and Jan Kynˇcl Charles University, Prague The story

Monotone crossing number of complete graphs Martin Balko, Radoslav Fulek and Jan Kynˇcl Charles University, Prague The story

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2013-06-24 21:33:16
42Journal of Machine Learning Research2159  Submitted 3/10; Revised 3/11; Published 7/11 Adaptive Subgradient Methods for Online Learning and Stochastic Optimization∗

Journal of Machine Learning Research2159 Submitted 3/10; Revised 3/11; Published 7/11 Adaptive Subgradient Methods for Online Learning and Stochastic Optimization∗

Add to Reading List

Source URL: www.jmlr.org

Language: English - Date: 2011-07-05 16:26:18
431  Perturbation Techniques in Online Learning and Optimization  Jacob Abernethy

1 Perturbation Techniques in Online Learning and Optimization Jacob Abernethy

Add to Reading List

Source URL: dept.stat.lsa.umich.edu

Language: English - Date: 2016-05-20 09:15:14
44Wavelets and Linear Algebra  Wavelets and Linear Algebra http://wala.vru.ac.ir Vali-e-Asr University of Rafsanjan

Wavelets and Linear Algebra Wavelets and Linear Algebra http://wala.vru.ac.ir Vali-e-Asr University of Rafsanjan

Add to Reading List

Source URL: wala.vru.ac.ir

Language: English - Date: 2016-08-22 22:03:32
45Existence, minimality and approximation of solutions to BSDEs with convex drivers Patrick Cheridito∗ Princeton University Princeton, NJ, USA

Existence, minimality and approximation of solutions to BSDEs with convex drivers Patrick Cheridito∗ Princeton University Princeton, NJ, USA

Add to Reading List

Source URL: www.princeton.edu

Language: English - Date: 2012-04-27 16:46:34
46Linear Programming and Unique Sink Orientations Bernd G¨artner∗ Institute of Theoretical Computer Science ETH Z¨ urich 8092 Z¨

Linear Programming and Unique Sink Orientations Bernd G¨artner∗ Institute of Theoretical Computer Science ETH Z¨ urich 8092 Z¨

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:10
47ISMP 2012 – Berlin  Convergence of Local Search Sebastian U. Stich Institute of Theoretical Computer Science Department of Computer Science

ISMP 2012 – Berlin Convergence of Local Search Sebastian U. Stich Institute of Theoretical Computer Science Department of Computer Science

Add to Reading List

Source URL: sstich.ch

Language: English - Date: 2012-08-27 04:51:50
48Grenoble Optimization Day November 5, LJK, Université Joseph Fourier, Grenoble, France How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem —

Grenoble Optimization Day November 5, LJK, Université Joseph Fourier, Grenoble, France How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem —

Add to Reading List

Source URL: bipop.inrialpes.fr

Language: English - Date: 2014-11-07 11:21:24
49GRAPHING MATH 152, SECTION 55 (VIPUL NAIK) Corresponding material in the book: Section 4.8 Difficulty level: Hard. What students should definitely get: The main concerns in graphing a function, how to figure out

GRAPHING MATH 152, SECTION 55 (VIPUL NAIK) Corresponding material in the book: Section 4.8 Difficulty level: Hard. What students should definitely get: The main concerns in graphing a function, how to figure out

Add to Reading List

Source URL: files.vipulnaik.com

Language: English - Date: 2016-08-13 11:33:29
50Generalized Convexity and Nonsmooth Optimization Diethard Pallaschke Contents of the lecture: 1 Convexity 1.1 Convexity in infinite-dimensionalSpaces 1.2 DC-Functions

Generalized Convexity and Nonsmooth Optimization Diethard Pallaschke Contents of the lecture: 1 Convexity 1.1 Convexity in infinite-dimensionalSpaces 1.2 DC-Functions

Add to Reading List

Source URL: www.wmie.uz.zgora.pl

Language: English - Date: 2013-08-30 00:10:16